In this article we investigate the application of iterated local search (ILS) to the single machine total weighted tardiness problem. Our research is inspired by the recently proposed iterated dynasearch approach, which was shown to be a very effective ILS algorithm for this problem. In this paper we systematically configure an ILS algorithms by optimizing the single procedures part of ILS and ...

Problem of scheduling on a single machine to minimize total weighted tardiness of jobs can be described as follows: there are n jobs to be processed, each job has an integer processing time, a weight and a due date. The objective is to minimize the total weighted tardiness of jobs. The problem belongs to the class of NP-hard problems. Some new properties of the problem associated with the block...

art exact algorithms suffer from relatively poor performances. On the other hand the problem has been successfully tackled by local search heuristic algorithms where the neighborhood of a solution is usually computed by applying swap (a.k.a. pairwise interchange) operators to the working sequence. Dynasearch is a neighborhood search technique introduced by Congram et al. [1] whose main feature ...

Nodifferencewas detected on the performances of construction heuristics for TSP developed in Task 1 between Euclidean instances with points uniformly sparse and Euclidean instances with points clustered. Attention was given to the choice of data structures to represent and maintain a solution during a perturbative search. We described Tabu Search (TS) and its variations: robust and reactive. We...

We provide two different neighborhood construction techniques for creating exponentially large neighborhoods that are searchable in polynomial time using dynamic programming. We illustrate both of these approaches on very large scale neighborhood search techniques for the traveling salesman problem. Our approaches are intended both to unify previously known results as well as to offer schemas f...

We provide two different neighborhood construction techniques for creating exponentially large neighborhoods that are searchable in polynomial time using dynamic programming. We illustrate both of these approaches on very large scale neighborhood search techniques for the traveling salesman problem. Our approaches unify previously known results and offer schemas for generating additional expone...

Most successful heuristics for solving 1||wjTj are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n3) to O(n2). We show that this result also improves the complexity of the dynasearch heuristics by Congram et al. [1] and Grosso et al. [3].

The one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties is addressed. This problem is NP-complete, so that local search approaches are very useful to efficiently find good feasible schedules. In this paper, we present an extension of the dynasearch neighborhood for this problem. Finding the best schedule in this neighborhood is shown to...

In this paper, an integrated machine scheduling withits due date setting problem has been considered. It is assumed that the machine is subject to some kind of random unavailability. Due dates should be set in an attractive and reliable manner, implying that they should be short and possible to be met. To this end, first, long due dates are penalized in the objective function. Then, for each cu...